Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(le, 0), y) → true
app(app(le, app(s, x)), 0) → false
app(app(le, app(s, x)), app(s, y)) → app(app(le, x), y)
app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(gcd, 0), y) → y
app(app(gcd, app(s, x)), 0) → app(s, x)
app(app(gcd, app(s, x)), app(s, y)) → app(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
app(app(app(if_gcd, true), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, x), y)), app(s, y))
app(app(app(if_gcd, false), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, y), x)), app(s, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

Q is empty.


QTRS
  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(le, 0), y) → true
app(app(le, app(s, x)), 0) → false
app(app(le, app(s, x)), app(s, y)) → app(app(le, x), y)
app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(gcd, 0), y) → y
app(app(gcd, app(s, x)), 0) → app(s, x)
app(app(gcd, app(s, x)), app(s, y)) → app(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
app(app(app(if_gcd, true), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, x), y)), app(s, y))
app(app(app(if_gcd, false), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, y), x)), app(s, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

Q is empty.

The TRS is overlay and locally confluent. By [15] we can switch to innermost.

↳ QTRS
  ↳ Overlay + Local Confluence
QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(le, 0), y) → true
app(app(le, app(s, x)), 0) → false
app(app(le, app(s, x)), app(s, y)) → app(app(le, x), y)
app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(gcd, 0), y) → y
app(app(gcd, app(s, x)), 0) → app(s, x)
app(app(gcd, app(s, x)), app(s, y)) → app(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
app(app(app(if_gcd, true), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, x), y)), app(s, y))
app(app(app(if_gcd, false), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, y), x)), app(s, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(app(le, 0), x0)
app(app(le, app(s, x0)), 0)
app(app(le, app(s, x0)), app(s, x1))
app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(gcd, 0), x0)
app(app(gcd, app(s, x0)), 0)
app(app(gcd, app(s, x0)), app(s, x1))
app(app(app(if_gcd, true), app(s, x0)), app(s, x1))
app(app(app(if_gcd, false), app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)


Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP(app(minus, x), app(s, y)) → APP(pred, app(app(minus, x), y))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(app(minus, x), app(s, y)) → APP(app(minus, x), y)
APP(app(app(if_gcd, true), app(s, x)), app(s, y)) → APP(app(minus, x), y)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(filter2, app(f, x)), f), x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(le, app(s, x)), app(s, y)) → APP(le, x)
APP(app(gcd, app(s, x)), app(s, y)) → APP(app(le, y), x)
APP(app(app(app(filter2, true), f), x), xs) → APP(app(cons, x), app(app(filter, f), xs))
APP(app(gcd, app(s, x)), app(s, y)) → APP(le, y)
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(filter2, app(f, x))
APP(app(app(if_gcd, true), app(s, x)), app(s, y)) → APP(minus, x)
APP(app(app(if_gcd, false), app(s, x)), app(s, y)) → APP(app(minus, y), x)
APP(app(app(if_gcd, false), app(s, x)), app(s, y)) → APP(gcd, app(app(minus, y), x))
APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(filter2, app(f, x)), f)
APP(app(app(app(filter2, false), f), x), xs) → APP(filter, f)
APP(app(le, app(s, x)), app(s, y)) → APP(app(le, x), y)
APP(app(app(if_gcd, false), app(s, x)), app(s, y)) → APP(minus, y)
APP(app(app(if_gcd, false), app(s, x)), app(s, y)) → APP(app(gcd, app(app(minus, y), x)), app(s, x))
APP(app(app(if_gcd, true), app(s, x)), app(s, y)) → APP(app(gcd, app(app(minus, x), y)), app(s, y))
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(gcd, app(s, x)), app(s, y)) → APP(app(if_gcd, app(app(le, y), x)), app(s, x))
APP(app(app(app(filter2, true), f), x), xs) → APP(filter, f)
APP(app(gcd, app(s, x)), app(s, y)) → APP(if_gcd, app(app(le, y), x))
APP(app(app(if_gcd, true), app(s, x)), app(s, y)) → APP(gcd, app(app(minus, x), y))
APP(app(gcd, app(s, x)), app(s, y)) → APP(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
APP(app(app(app(filter2, true), f), x), xs) → APP(cons, x)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))

The TRS R consists of the following rules:

app(app(le, 0), y) → true
app(app(le, app(s, x)), 0) → false
app(app(le, app(s, x)), app(s, y)) → app(app(le, x), y)
app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(gcd, 0), y) → y
app(app(gcd, app(s, x)), 0) → app(s, x)
app(app(gcd, app(s, x)), app(s, y)) → app(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
app(app(app(if_gcd, true), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, x), y)), app(s, y))
app(app(app(if_gcd, false), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, y), x)), app(s, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(app(le, 0), x0)
app(app(le, app(s, x0)), 0)
app(app(le, app(s, x0)), app(s, x1))
app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(gcd, 0), x0)
app(app(gcd, app(s, x0)), 0)
app(app(gcd, app(s, x0)), app(s, x1))
app(app(app(if_gcd, true), app(s, x0)), app(s, x1))
app(app(app(if_gcd, false), app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
QDP
          ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(minus, x), app(s, y)) → APP(pred, app(app(minus, x), y))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(app(minus, x), app(s, y)) → APP(app(minus, x), y)
APP(app(app(if_gcd, true), app(s, x)), app(s, y)) → APP(app(minus, x), y)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(filter2, app(f, x)), f), x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(le, app(s, x)), app(s, y)) → APP(le, x)
APP(app(gcd, app(s, x)), app(s, y)) → APP(app(le, y), x)
APP(app(app(app(filter2, true), f), x), xs) → APP(app(cons, x), app(app(filter, f), xs))
APP(app(gcd, app(s, x)), app(s, y)) → APP(le, y)
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(filter2, app(f, x))
APP(app(app(if_gcd, true), app(s, x)), app(s, y)) → APP(minus, x)
APP(app(app(if_gcd, false), app(s, x)), app(s, y)) → APP(app(minus, y), x)
APP(app(app(if_gcd, false), app(s, x)), app(s, y)) → APP(gcd, app(app(minus, y), x))
APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(filter2, app(f, x)), f)
APP(app(app(app(filter2, false), f), x), xs) → APP(filter, f)
APP(app(le, app(s, x)), app(s, y)) → APP(app(le, x), y)
APP(app(app(if_gcd, false), app(s, x)), app(s, y)) → APP(minus, y)
APP(app(app(if_gcd, false), app(s, x)), app(s, y)) → APP(app(gcd, app(app(minus, y), x)), app(s, x))
APP(app(app(if_gcd, true), app(s, x)), app(s, y)) → APP(app(gcd, app(app(minus, x), y)), app(s, y))
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(gcd, app(s, x)), app(s, y)) → APP(app(if_gcd, app(app(le, y), x)), app(s, x))
APP(app(app(app(filter2, true), f), x), xs) → APP(filter, f)
APP(app(gcd, app(s, x)), app(s, y)) → APP(if_gcd, app(app(le, y), x))
APP(app(app(if_gcd, true), app(s, x)), app(s, y)) → APP(gcd, app(app(minus, x), y))
APP(app(gcd, app(s, x)), app(s, y)) → APP(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
APP(app(app(app(filter2, true), f), x), xs) → APP(cons, x)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))

The TRS R consists of the following rules:

app(app(le, 0), y) → true
app(app(le, app(s, x)), 0) → false
app(app(le, app(s, x)), app(s, y)) → app(app(le, x), y)
app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(gcd, 0), y) → y
app(app(gcd, app(s, x)), 0) → app(s, x)
app(app(gcd, app(s, x)), app(s, y)) → app(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
app(app(app(if_gcd, true), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, x), y)), app(s, y))
app(app(app(if_gcd, false), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, y), x)), app(s, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(app(le, 0), x0)
app(app(le, app(s, x0)), 0)
app(app(le, app(s, x0)), app(s, x1))
app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(gcd, 0), x0)
app(app(gcd, app(s, x0)), 0)
app(app(gcd, app(s, x0)), app(s, x1))
app(app(app(if_gcd, true), app(s, x0)), app(s, x1))
app(app(app(if_gcd, false), app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
QDP
              ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(minus, x), app(s, y)) → APP(pred, app(app(minus, x), y))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(app(minus, x), app(s, y)) → APP(app(minus, x), y)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(filter2, app(f, x)), f), x)
APP(app(app(if_gcd, true), app(s, x)), app(s, y)) → APP(app(minus, x), y)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(le, app(s, x)), app(s, y)) → APP(le, x)
APP(app(gcd, app(s, x)), app(s, y)) → APP(app(le, y), x)
APP(app(app(app(filter2, true), f), x), xs) → APP(app(cons, x), app(app(filter, f), xs))
APP(app(filter, f), app(app(cons, x), xs)) → APP(filter2, app(f, x))
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(gcd, app(s, x)), app(s, y)) → APP(le, y)
APP(app(app(if_gcd, false), app(s, x)), app(s, y)) → APP(app(minus, y), x)
APP(app(app(if_gcd, true), app(s, x)), app(s, y)) → APP(minus, x)
APP(app(app(if_gcd, false), app(s, x)), app(s, y)) → APP(gcd, app(app(minus, y), x))
APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(filter2, app(f, x)), f)
APP(app(app(app(filter2, false), f), x), xs) → APP(filter, f)
APP(app(le, app(s, x)), app(s, y)) → APP(app(le, x), y)
APP(app(app(if_gcd, false), app(s, x)), app(s, y)) → APP(minus, y)
APP(app(app(if_gcd, false), app(s, x)), app(s, y)) → APP(app(gcd, app(app(minus, y), x)), app(s, x))
APP(app(app(if_gcd, true), app(s, x)), app(s, y)) → APP(app(gcd, app(app(minus, x), y)), app(s, y))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(gcd, app(s, x)), app(s, y)) → APP(app(if_gcd, app(app(le, y), x)), app(s, x))
APP(app(app(app(filter2, true), f), x), xs) → APP(filter, f)
APP(app(gcd, app(s, x)), app(s, y)) → APP(if_gcd, app(app(le, y), x))
APP(app(app(if_gcd, true), app(s, x)), app(s, y)) → APP(gcd, app(app(minus, x), y))
APP(app(gcd, app(s, x)), app(s, y)) → APP(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
APP(app(app(app(filter2, true), f), x), xs) → APP(cons, x)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))

The TRS R consists of the following rules:

app(app(le, 0), y) → true
app(app(le, app(s, x)), 0) → false
app(app(le, app(s, x)), app(s, y)) → app(app(le, x), y)
app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(gcd, 0), y) → y
app(app(gcd, app(s, x)), 0) → app(s, x)
app(app(gcd, app(s, x)), app(s, y)) → app(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
app(app(app(if_gcd, true), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, x), y)), app(s, y))
app(app(app(if_gcd, false), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, y), x)), app(s, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(app(le, 0), x0)
app(app(le, app(s, x0)), 0)
app(app(le, app(s, x0)), app(s, x1))
app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(gcd, 0), x0)
app(app(gcd, app(s, x0)), 0)
app(app(gcd, app(s, x0)), app(s, x1))
app(app(app(if_gcd, true), app(s, x0)), app(s, x1))
app(app(app(if_gcd, false), app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 4 SCCs with 21 less nodes.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ AND
QDP
                    ↳ QDPOrderProof
                  ↳ QDP
                  ↳ QDP
                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(app(minus, x), app(s, y)) → APP(app(minus, x), y)

The TRS R consists of the following rules:

app(app(le, 0), y) → true
app(app(le, app(s, x)), 0) → false
app(app(le, app(s, x)), app(s, y)) → app(app(le, x), y)
app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(gcd, 0), y) → y
app(app(gcd, app(s, x)), 0) → app(s, x)
app(app(gcd, app(s, x)), app(s, y)) → app(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
app(app(app(if_gcd, true), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, x), y)), app(s, y))
app(app(app(if_gcd, false), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, y), x)), app(s, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(app(le, 0), x0)
app(app(le, app(s, x0)), 0)
app(app(le, app(s, x0)), app(s, x1))
app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(gcd, 0), x0)
app(app(gcd, app(s, x0)), 0)
app(app(gcd, app(s, x0)), app(s, x1))
app(app(app(if_gcd, true), app(s, x0)), app(s, x1))
app(app(app(if_gcd, false), app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13]. Here, we combined the reduction pair processor with the A-transformation [14] which results in the following intermediate Q-DP Problem.
Q DP problem:
The TRS P consists of the following rules:

MINUS(x, s(y)) → MINUS(x, y)

R is empty.
The set Q consists of the following terms:

le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
pred(s(x0))
minus(x0, 0)
minus(x0, s(x1))
gcd(0, x0)
gcd(s(x0), 0)
gcd(s(x0), s(x1))
if_gcd(true, s(x0), s(x1))
if_gcd(false, s(x0), s(x1))
map(x0, nil)
map(x0, cons(x1, x2))
filter(x0, nil)
filter(x0, cons(x1, x2))
filter2(true, x0, x1, x2)
filter2(false, x0, x1, x2)

We have to consider all minimal (P,Q,R)-chains.


The following pairs can be oriented strictly and are deleted.


APP(app(minus, x), app(s, y)) → APP(app(minus, x), y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
MINUS(x1, x2)  =  x2
s(x1)  =  s(x1)

Recursive Path Order [2].
Precedence:
trivial

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ AND
                  ↳ QDP
                    ↳ QDPOrderProof
QDP
                        ↳ PisEmptyProof
                  ↳ QDP
                  ↳ QDP
                  ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(le, 0), y) → true
app(app(le, app(s, x)), 0) → false
app(app(le, app(s, x)), app(s, y)) → app(app(le, x), y)
app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(gcd, 0), y) → y
app(app(gcd, app(s, x)), 0) → app(s, x)
app(app(gcd, app(s, x)), app(s, y)) → app(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
app(app(app(if_gcd, true), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, x), y)), app(s, y))
app(app(app(if_gcd, false), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, y), x)), app(s, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(app(le, 0), x0)
app(app(le, app(s, x0)), 0)
app(app(le, app(s, x0)), app(s, x1))
app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(gcd, 0), x0)
app(app(gcd, app(s, x0)), 0)
app(app(gcd, app(s, x0)), app(s, x1))
app(app(app(if_gcd, true), app(s, x0)), app(s, x1))
app(app(app(if_gcd, false), app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ AND
                  ↳ QDP
QDP
                    ↳ QDPOrderProof
                  ↳ QDP
                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(app(le, app(s, x)), app(s, y)) → APP(app(le, x), y)

The TRS R consists of the following rules:

app(app(le, 0), y) → true
app(app(le, app(s, x)), 0) → false
app(app(le, app(s, x)), app(s, y)) → app(app(le, x), y)
app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(gcd, 0), y) → y
app(app(gcd, app(s, x)), 0) → app(s, x)
app(app(gcd, app(s, x)), app(s, y)) → app(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
app(app(app(if_gcd, true), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, x), y)), app(s, y))
app(app(app(if_gcd, false), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, y), x)), app(s, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(app(le, 0), x0)
app(app(le, app(s, x0)), 0)
app(app(le, app(s, x0)), app(s, x1))
app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(gcd, 0), x0)
app(app(gcd, app(s, x0)), 0)
app(app(gcd, app(s, x0)), app(s, x1))
app(app(app(if_gcd, true), app(s, x0)), app(s, x1))
app(app(app(if_gcd, false), app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13]. Here, we combined the reduction pair processor with the A-transformation [14] which results in the following intermediate Q-DP Problem.
Q DP problem:
The TRS P consists of the following rules:

LE(s(x), s(y)) → LE(x, y)

R is empty.
The set Q consists of the following terms:

le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
pred(s(x0))
minus(x0, 0)
minus(x0, s(x1))
gcd(0, x0)
gcd(s(x0), 0)
gcd(s(x0), s(x1))
if_gcd(true, s(x0), s(x1))
if_gcd(false, s(x0), s(x1))
map(x0, nil)
map(x0, cons(x1, x2))
filter(x0, nil)
filter(x0, cons(x1, x2))
filter2(true, x0, x1, x2)
filter2(false, x0, x1, x2)

We have to consider all minimal (P,Q,R)-chains.


The following pairs can be oriented strictly and are deleted.


APP(app(le, app(s, x)), app(s, y)) → APP(app(le, x), y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
LE(x1, x2)  =  LE(x2)
s(x1)  =  s(x1)

Recursive Path Order [2].
Precedence:
s1 > LE1

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ AND
                  ↳ QDP
                  ↳ QDP
                    ↳ QDPOrderProof
QDP
                        ↳ PisEmptyProof
                  ↳ QDP
                  ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(le, 0), y) → true
app(app(le, app(s, x)), 0) → false
app(app(le, app(s, x)), app(s, y)) → app(app(le, x), y)
app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(gcd, 0), y) → y
app(app(gcd, app(s, x)), 0) → app(s, x)
app(app(gcd, app(s, x)), app(s, y)) → app(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
app(app(app(if_gcd, true), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, x), y)), app(s, y))
app(app(app(if_gcd, false), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, y), x)), app(s, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(app(le, 0), x0)
app(app(le, app(s, x0)), 0)
app(app(le, app(s, x0)), app(s, x1))
app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(gcd, 0), x0)
app(app(gcd, app(s, x0)), 0)
app(app(gcd, app(s, x0)), app(s, x1))
app(app(app(if_gcd, true), app(s, x0)), app(s, x1))
app(app(app(if_gcd, false), app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ AND
                  ↳ QDP
                  ↳ QDP
QDP
                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(app(gcd, app(s, x)), app(s, y)) → APP(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
APP(app(app(if_gcd, false), app(s, x)), app(s, y)) → APP(app(gcd, app(app(minus, y), x)), app(s, x))
APP(app(app(if_gcd, true), app(s, x)), app(s, y)) → APP(app(gcd, app(app(minus, x), y)), app(s, y))

The TRS R consists of the following rules:

app(app(le, 0), y) → true
app(app(le, app(s, x)), 0) → false
app(app(le, app(s, x)), app(s, y)) → app(app(le, x), y)
app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(gcd, 0), y) → y
app(app(gcd, app(s, x)), 0) → app(s, x)
app(app(gcd, app(s, x)), app(s, y)) → app(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
app(app(app(if_gcd, true), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, x), y)), app(s, y))
app(app(app(if_gcd, false), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, y), x)), app(s, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(app(le, 0), x0)
app(app(le, app(s, x0)), 0)
app(app(le, app(s, x0)), app(s, x1))
app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(gcd, 0), x0)
app(app(gcd, app(s, x0)), 0)
app(app(gcd, app(s, x0)), app(s, x1))
app(app(app(if_gcd, true), app(s, x0)), app(s, x1))
app(app(app(if_gcd, false), app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ AND
                  ↳ QDP
                  ↳ QDP
                  ↳ QDP
QDP
                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)

The TRS R consists of the following rules:

app(app(le, 0), y) → true
app(app(le, app(s, x)), 0) → false
app(app(le, app(s, x)), app(s, y)) → app(app(le, x), y)
app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(gcd, 0), y) → y
app(app(gcd, app(s, x)), 0) → app(s, x)
app(app(gcd, app(s, x)), app(s, y)) → app(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
app(app(app(if_gcd, true), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, x), y)), app(s, y))
app(app(app(if_gcd, false), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, y), x)), app(s, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(app(le, 0), x0)
app(app(le, app(s, x0)), 0)
app(app(le, app(s, x0)), app(s, x1))
app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(gcd, 0), x0)
app(app(gcd, app(s, x0)), 0)
app(app(gcd, app(s, x0)), app(s, x1))
app(app(app(if_gcd, true), app(s, x0)), app(s, x1))
app(app(app(if_gcd, false), app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
The remaining pairs can at least be oriented weakly.

APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)
Used ordering: Combined order from the following AFS and order.
APP(x1, x2)  =  APP(x2)
app(x1, x2)  =  app(x1, x2)
filter2  =  filter2
true  =  true
filter  =  filter
map  =  map
cons  =  cons
false  =  false
gcd  =  gcd
s  =  s
if_gcd  =  if_gcd
le  =  le
minus  =  minus
pred  =  pred
0  =  0
nil  =  nil

Recursive Path Order [2].
Precedence:
true > cons > APP1 > filter
true > s > ifgcd > filter
true > s > le > filter
true > minus > filter
map > app2 > filter2 > APP1 > filter
map > app2 > cons > APP1 > filter
map > app2 > s > ifgcd > filter
map > app2 > s > le > filter
map > app2 > minus > filter
map > app2 > pred > filter
map > app2 > nil > filter
false > app2 > filter2 > APP1 > filter
false > app2 > cons > APP1 > filter
false > app2 > s > ifgcd > filter
false > app2 > s > le > filter
false > app2 > minus > filter
false > app2 > pred > filter
false > app2 > nil > filter
gcd > app2 > filter2 > APP1 > filter
gcd > app2 > cons > APP1 > filter
gcd > app2 > s > ifgcd > filter
gcd > app2 > s > le > filter
gcd > app2 > minus > filter
gcd > app2 > pred > filter
gcd > app2 > nil > filter
0 > s > ifgcd > filter
0 > s > le > filter

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ AND
                  ↳ QDP
                  ↳ QDP
                  ↳ QDP
                  ↳ QDP
                    ↳ QDPOrderProof
QDP
                        ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)

The TRS R consists of the following rules:

app(app(le, 0), y) → true
app(app(le, app(s, x)), 0) → false
app(app(le, app(s, x)), app(s, y)) → app(app(le, x), y)
app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(gcd, 0), y) → y
app(app(gcd, app(s, x)), 0) → app(s, x)
app(app(gcd, app(s, x)), app(s, y)) → app(app(app(if_gcd, app(app(le, y), x)), app(s, x)), app(s, y))
app(app(app(if_gcd, true), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, x), y)), app(s, y))
app(app(app(if_gcd, false), app(s, x)), app(s, y)) → app(app(gcd, app(app(minus, y), x)), app(s, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(app(le, 0), x0)
app(app(le, app(s, x0)), 0)
app(app(le, app(s, x0)), app(s, x1))
app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(gcd, 0), x0)
app(app(gcd, app(s, x0)), 0)
app(app(gcd, app(s, x0)), app(s, x1))
app(app(app(if_gcd, true), app(s, x0)), app(s, x1))
app(app(app(if_gcd, false), app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 2 less nodes.